Acyclic list edge coloring of outerplanar graphs

Acyclic List Edge Coloring of Graphs

List total coloring of pseudo-outerplanar graphs

A graph is pseudo-outerplanar if each of its blocks has an embedding in the plane so that the vertices lie on a fixed circle and the edges lie inside the disk of this circle with each of them crossing at most one another. It is proved that every pseudo-outerplanar graph with maximum degree ∆ ≥ 5 is totally (∆ + 1)-choosable.

On list-coloring extendable outerplanar graphs∗

We investigate a variation on Thomassen’s 2and 3-extendability of precoloring extensions for list-coloring graphs. For an outerplanar graph G with i, j ≤ 2, we say that G is {i, j}-extendable if for every pair of nonadjacent vertices x and y, whenever x is assigned an i-list, y is assigned a j-list, and all other vertices have a 3-list, G is list-colorable. We characterize the {1, 1}and the {1,...

Acyclic edge coloring of graphs

An acyclic edge coloring of a graph G is a proper edge coloring such that the subgraph induced by any two color classes is a linear forest (an acyclic graph with maximum degree at most two). The acyclic chromatic index χa(G) of a graph G is the least number of colors needed in any acyclic edge coloring of G. Fiamčík (1978) conjectured that χa(G) ≤ ∆(G) + 2, where ∆(G) is the maximum degree of G...

List Edge Colorings of Outerplanar Graphs